How useful are closed captions for learning mathematics via online video?

Closed captioning of instructional videos is a topic that has not seen much discussion despite its importance for hearing-impaired students and recent legal ramifications if videos are not appropriately captioned. In particular, it is unclear what best practice in captioning videos should be to benefit all learners in disciplines such as mathematics with a reliance on the development of visual explanation while providing audio narration. In this paper, we report on a study undertaken at an Australian university, to investigate the perceived level of usefulness of captions and their automatic translations in a mathematics course. We discovered that students broadly agreed that captions are a useful learning feature: to allow flexibility of where and when a video is watched, but also to help understand speaker accents, and clarify explanations that are difficult to hear in the recording. Due to the high levels of use and perceived educational benefits of closed captions in online video but limited literature, there is a significant need for new research in this area. An urgent discussion is needed to explore how students engage with closed captions, how they may support learning, and to investigate implications on instructional design of mathematical videos.     

Path-following interior point algorithms for the Cartesian <Emphasis Type="Italic">P</Emphasis><Subscript>*</Subscript>(κ)-LCP over symmetric cones

In this paper, we establish a theoretical framework of path-following interior point algorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P _*(κ)-property, a weaker condition than the monotonicity. Based on the Nesterov-Todd, xy and yx directions employed as commutative search directions for semidefinite programming, we extend the variants of the short-, semilong-, and long-step path-following algorithms for symmetric conic linear programming proposed by Schmieta and Alizadeh to the Cartesian P _*(κ)-SCLCP, and particularly show the global convergence and the iteration complexities of the proposed algorithms. This work was supported by National Natural Science Foundation of China (Grant Nos. 10671010, 70841008)     

ON TAYLOR'S CONJECTURE ABOUT THE PACKING MEASURES OF CARTESIAN PRODUCT SETS

1.IntroductionInthegeometryoffractals,Hausdorffmeasurealiddimensionplayaveryimportantrole.Olltheotherhand,therecelltilltroductionofpackingmeasureshasledtoagreaterunderstandillgofthegeometrictheoryoffractals,aspackingmeasuresbehaveillawnythatis'dual'toHausdoofmeasure8inmanyrespectsl2].Forexample,denotingHausdorffdimellsionandpackingdimensionbydimandDimrespectively,wehavedim(ExF)2dimE dimF,whileDim(ExF)5DimE DimF.Itiswell-kllowenthatifECRm,FCR",thenH(ExFW1T2)2b'H((E,W1)H(FW2)forsome…     

An accelerated closed universe

We study a model in which a closed universe with dust and quintessence matter components may look like an accelerated flat Friedmann–Robertson–Walker (FRW) universe at low redshifts. Several quantities relevant to the model are expressed in terms of observed density parameters, _M and , and of the associated density parameter _Q related to the quintessence scalar field Q.     

序列覆盖的闭映射保持可度量性

设f:X→Y是连续的满映射. f称为序列覆盖映射,若{y})是Y中的收敛序列,则存在X中的收敛序列{xn},使得每一xn∈f-1(yn);f称为1序列覆盖映射,若对于每-y∈Y,存在x∈f-1(y),使得如果{yn}是Y中收敛于点y的序列,则有X中收敛于点x的序列{xn},使得每一xn∈f-1(yn).本文研究度量空间序列覆盖的闭映射之构造,否定地回答了Topology and its Applications上提出的一个问题.     

Function Spaces of Posets with Projections

This paper investigates function spaces of structures consisting of a partially ordered set together with some directed family of projections.More precisely, given a fixed directed index set (I,), we consider triples (D,,(p _i ) _iI ) with (D,) a poset and (p _i ) _iI a monotone net of projections of D. We call them (I,)-pop's (posets with projections). Our main purpose is to study structure preserving maps between (I,)-pop's. Such homomorphisms respect both order and projections.Any (I,)-pop is known to induce a uniformity and thus a topology. The set of all homomorphisms between two (I,)-pop's turns out to form an (I,)-pop itself. We show that its uniformity is the uniformity of uniform convergence. This enables us to prove that properties such as completeness and compactness transfer to function pop's.Concerning categorical properties of (I,)-pop's, we will see that we are in a lucky situation from a computer scientist's point of view: we obtain Cartesian closed categories. Moreover, by a D -construction we get (I,)-pop's that are isomorphic to their own exponent. This yields new models for the untyped -calculus.     

Common properties of table algebras and association schemes

The concept of table algebra in the title is a real nonsingular generalized table algebra in the sense of [Z. Arad, E. Fisman, M. Muzychuk, Generalized table algebras, Israel J. Math. 114 (1999) 29–60]. In this paper we first give some definitions and facts about table algebras. It is well known that every association scheme gives a Hecke-algebra which is a table algebra too. This leads to the natural question which properties of association schemes stay valid for table algebras. For instance, we prove the Second Isomorphism Theorem and the Jordan–Holder's theorem for standard table algebras.     

The vertex isoperimetric problem for the powers of the diamond graph

We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the well-studied graphs like hypercubes, grids, and tori. In contrast to the mentioned graphs, our graph is not bipartite. We present an exact solution to the vertex isoperimetric problem on our graph by introducing a new class of orders that unifies all known isoperimetric orders defined on the cartesian powers of graphs.